#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;

vector<int> diStringMatch(string s) {
    vector<int> ret;
    int n = s.size();
    int left = 0, right = n;
    for (int i = 0; i < n; ++i)
    {
        if (s[i] == 'I')
        {
            ret.push_back(left++);
        }
        else
        {
            ret.push_back(right--);
        }
    }
    ret.push_back(left);
    return ret;
}

int main()
{

	return 0;
}